Dp-based Approximations
نویسنده
چکیده
We discuss approximation algorithms based on Dynamic Programming techniques. Through Makespan and Knapsack, we see common ideas such as the dual view of parameters and bucketing and rounding values to a smaller distinct number of values, both of which can help facilitate the use of DP to approximate a solution. The Traveling Salesman Problem is also explored; the Euclidean version of TSP has a DP-based approximation algorithm.
منابع مشابه
Coarse-to-Fine Dynamic Programming
We introduce an extension of dynamic programming DP we call Coarse to Fine Dynamic Programming CFDP ideally suited to DP problems with large state space CFDP uses dynamic programming to solve a sequence of coarse approximations which are lower bounds to the original DP problem These approximations are developed by merging states in the original graph into superstates in a coarser graph which us...
متن کاملCollapsed Variational Dirichlet Process Mixture Models
Nonparametric Bayesian mixture models, in particular Dirichlet process (DP) mixture models, have shown great promise for density estimation and data clustering. Given the size of today’s datasets, computational efficiency becomes an essential ingredient in the applicability of these techniques to real world data. We study and experimentally compare a number of variational Bayesian (VB) approxim...
متن کاملPoint-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategies for cooperative multi-agent systems. Our approach makes a connection between optimal DP algorithms for partially observable stochastic games, and point-based approximations for singleagent POMDPs. We show for the fir...
متن کاملRobust Data-Driven Dynamic Programming
In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions are estimated via kernel regression, however, the historical sample paths enter the solution procedure directly as they determine the evaluatio...
متن کاملApplying revenue management to agent-based transportation planning
We consider a multi-company, less-than-truckload, dynamic VRP based on the concept of multi-agent systems. We focus on the intelligence of one vehicle agent and especially on its bidding strategy. We address the problem how to price loads that are offered in real-time such that available capacity is used in the most profitable way taking into account possible future revenues. We develop methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014